Formal Semantics for Interacting UML subsystems

State Machines Formal semantics for large part of UML using Abstract State Machines (Gurevich). Transition systems. States: multi-sorted first-order structures (set with function names and function interpretations). ASM: set of states (incl. initial state) and update rule. Jan Jürjens, TU Munich: Formal Semantics for Interacting UML subsystems 6 Abstract State Machines: Update rules Update rules: modify function interpretation: • f(s̄) := t • if g then R else S • seq R S endseq • iterate(R) • . . . Iteratively fire update rule, starting with initial state. Interactive ASM: (A, in, out), rules Init(A), Main(A)State Machines: Update rules Update rules: modify function interpretation: • f(s̄) := t • if g then R else S • seq R S endseq • iterate(R) • . . . Iteratively fire update rule, starting with initial state. Interactive ASM: (A, in, out), rules Init(A), Main(A) Jan Jürjens, TU Munich: Formal Semantics for Interacting UML subsystems 7